On $3$-uniform hypergraphs without linear cycles
نویسندگان
چکیده
منابع مشابه
On 3-uniform hypergraphs without linear cycles∗
We explore properties of 3-uniform hypergraphs H without linear cycles. It is surprising that even the simplest facts about ensuring cycles in graphs can be fairly complicated to prove for hypergraphs. Our main results are that 3-uniform hypergraphs without linear cycles must contain a vertex of strong degree at most two and must have independent sets of size at least 2|V (H)| 5 .
متن کاملThe Number of Hypergraphs without Linear Cycles
The r-uniform linear k-cycle C k is the r-uniform hypergraph on k(r−1) vertices whose edges are sets of r consecutive vertices in a cyclic ordering of the vertex set chosen in such a way that every pair of consecutive edges share exactly one vertex. Here, we prove a balanced supersaturation result for linear cycles which we then use in conjunction with the method of hypergraph containers to sho...
متن کاملDecomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...
متن کاملLoose Hamilton Cycles in Random 3-Uniform Hypergraphs
In the random hypergraph H = Hn,p;3 each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {xi, yi, xi+1} for i = 1, 2, . . . , n/2 where x1, x2, . . . , xn/2, y1, y2, . . . , yn/2 are all distinct. We prove that there exists an absolute constant K > 0 such that if p > K logn n then lim n→∞ 4|n Pr(Hn,p;3 contains a loose Ham...
متن کاملPartitioning 3-uniform hypergraphs
Bollobás and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges can be partitioned into r sets so that each set meets at least rm/(2r − 1) edges. For r = 3, Bollobás, Reed and Thomason proved the lower bound (1− 1/e)m/3 ≈ 0.21m, which was improved to 5m/9 by Bollobás and Scott (while the conjectured bound is 3m/5). In this paper, we show that this Bollobás-Thomason ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2016
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2016.v7.n1.a8